Parallel dynamic and kinetic regular triangulation in three dimensions
نویسندگان
چکیده
A parallel algorithm for regular triangulations is presented. For the purpose of fully dynamic and kinetic particle simulations it allows vertex insertion, deletion, movement, and weight changes. We describe new algorithms for incremental construction of regular triangulations, parallel vertex deletion and insertion. Finally, a parallel Lawson flip algorithm for vertex displacements is presented. The performance analysis demonstrates a significant parallel efficiency for various system sizes and performed changes. 2005 Elsevier B.V. All rights reserved. PACS: 87.18.-h; 87.18.Bb; 87.18.Hf; 81.05.Rm
منابع مشابه
A Lagrangian Approach to Dynamic Interfaces through Kinetic Triangulation of the Ambient Space
In this paper, we propose a robust and efficient Lagrangian approach for modeling dynamic interfaces between different materials undergoing large deformations and topology changes, in two dimensions. Our work brings an interesting alternative to popular techniques such as the level set method and the particle level set method, for two-dimensional and axisymmetric simulations. The principle of o...
متن کاملKinetic and dynamic Delaunay tetrahedralizations in three dimensions
We describe the implementation of algorithms to construct and maintain threedimensional dynamic Delaunay triangulations with kinetic vertices using a threesimplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tessellation. Initially, a given list of points is triangulated. Time evolution of the triangulation is not only governed by kinetic vert...
متن کاملA package for exact kinetic data structures and sweepline algorithms
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was influenced by various considerations, including extensibility, support for multiple kinetic data structures, access to existing data structures and algorithms in CGAL, as well as debugging. Due to the similarity betwee...
متن کاملDynamic Parallel 3D Delaunay Triangulation
Delaunay meshing is a popular technique for mesh generation. Usually, the mesh has to be refined so that certain fidelity and quality criteria are met. Delaunay refinement is achieved by dynamically inserting and removing points in/from a Delaunay triangulation. In this paper, we present a robust parallel algorithm for computing Delaunay triangulations in three dimensions. Our triangulator offe...
متن کاملOn the Consistency of the Combinatorial Codifferential
In 1976, Dodziuk and Patodi employed Whitney forms to define a combinatorial codifferential operator on cochains, and they raised the question whether it is consistent in the sense that for a smooth enough differential form the combinatorial codifferential of the associated cochain converges to the exterior codifferential of the form as the triangulation is refined. In 1991, Smits proved this t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Physics Communications
دوره 172 شماره
صفحات -
تاریخ انتشار 2005